Extra Edge Connectivity and Extremal Problems in Education Networks
نویسندگان
چکیده
Extra edge connectivity and diagnosability have been employed to investigate the fault tolerance properties of network structures. The p-extra ?p(?) a graph ? was introduced by Fàbrega Fiol in 1996. In this paper, we find exact values some special graphs. Moreover, give upper lower bounds for ?p(?), graphs with ?p(?)=1,2,n2n2?1,n2n2 are characterized. Finally, obtain three extremal results connectivity.
منابع مشابه
Extra edge connectivity of hypercube-like networks
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملEdge-Connectivity Augmentation Problems
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Ch...
متن کاملSome Extremal Problems for Edge-Regular Graphs
We consider the class ER(n, d, λ) of edge-regular graphs for some n > d > λ, i.e., graphs regular of degree d on n vertices, with each pair of adjacent vertices having λ common neighbors. It has previously been shown that for such graphs with λ > 0 we have n ≥ 3(d − λ) and much has been done to characterize such graphs when equality holds. Here we show that n ≥ 3(d − λ) + 1 if λ > 0 and d is od...
متن کاملSource location problems considering vertex-connectivity and edge-connectivity simultaneously
Let G (V, E) be an undirected multigraph, where V and E are a set of vertices and a set of edges, respectively. Let k and l be fixed nonnegative integers. This paper considers location problems of finding a minimum-size vertex-subset S V such that for each vertex x V the vertex-connectivity between S and x is greater than or equal to k and the edge-connectivity between S and x is greater than o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10193475